Estimation of high-dimensional partially-observed discrete Markov random fields
نویسندگان
چکیده
منابع مشابه
Estimation of High-dimensional Partially-observed Discrete Markov Random Fields
We consider the problem of estimating the parameters of discrete Markov random fields from partially observed data in a high-dimensional setting. Using a `-penalized pseudo-likelihood approach, we fit a misspecified model obtained by ignoring the missing data problem. We derive an estimation error bound that highlights the effect of the misspecification. We report some simulation results that i...
متن کاملEstimation of Network Structures from Partially Observed Markov Random Fields
We consider the estimation of high-dimensional network structures from partially observed Markov random field data using a `-penalized pseudo-likelihood approach. We fit a misspecified model obtained by ignoring the missing data problem. We derive an estimation error bound that highlights the effect of the misspecification. We report some simulation results that illustrate the theoretical findi...
متن کاملHigh-Dimensional Structured Feature Screening Using Binary Markov Random Fields
Feature screening is a useful feature selection approach for high-dimensional data when the goal is to identify all the features relevant to the response variable. However, common feature screening methods do not take into account the correlation structure of the covariate space. We propose the concept of a feature relevance network, a binary Markov random field to represent the relevance of ea...
متن کاملChange point estimation in high dimensional Markov random-field models.
This paper investigates a change-point estimation problem in the context of high-dimensional Markov random field models. Change-points represent a key feature in many dynamically evolving network structures. The change-point estimate is obtained by maximizing a profile penalized pseudo-likelihood function under a sparsity assumption. We also derive a tight bound for the estimate, up to a logari...
متن کاملEfficient Parallel Estimation for Markov Random Fields
We present a new , deterministic, distributed MAPes timation algorithm for Markov Random Fields called Local Highest Confidence First (Local HCF). The al gorithm has been applied to segmentation problems in computer vision and its performance compared with stochastic algorithms. The experiments show that Local HCF finds better estimates than stochas tic algorithms with much less computation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Statistics
سال: 2014
ISSN: 1935-7524
DOI: 10.1214/14-ejs946